Achieving Fairness-Aware Two-Level Scheduling for Heterogeneous Distributed Systems

نویسندگان

چکیده

In a heterogeneous distributed system composed of various types computing platforms such as supercomputers, grids, and clouds, two-level scheduling approach can be used to effectively distribute resources the users in first-level, map tasks nodes for each platform second-level executing many-task applications. When resources, service providers should consider fairness among multiple well efficiency. However, cannot achieved by simply distributing an equal amount from every user. this paper, we investigate how address issue system. We present three first-level resource allocation policies provider affinity first policy, application based round-robin two task mapping most affected policy co-runner policy. Using trace-based simulations, evaluate performance combinations second level policies. Our extensive simulation results demonstrate that plays crucial role achieve relatively good fairness.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Data - Aware Workflow Scheduling in Heterogeneous Distributed Systems

Data transferring in scientific workflows gradually attracts more attention due to large amounts of data generated by complex scientific workflows will significantly increase the turnaround time of the whole workflow. It is almost impossible to make an optimal or approximate optimal scheduling for the end-to-end workflow without considering the intermediate data movement. In order to reduce the...

متن کامل

Achieving Application Level Fairness Through Utility-based Wireless Fair Scheduling

The increasing number of wireless data users and the deployment of broadband wireless networks have brought the issue of providing fair channel access to the forefront. Wireless fair scheduling algorithms must deal with unique domainspecific issues such as location-dependent and bursty channel error. In the past, a number of scheduling disciplines have been proposed for approximating fluid fair...

متن کامل

Data-Aware Scheduling In Massive Heterogeneous Systems

Data-aware scheduling in large-scale heterogeneous computing systems remains a challenging research issue, especially in the era of Big Data. Design of all data-related components of the popular distributed environments, such as Data Clouds (DCs), Data Grids (DGs) and Data Centers supports the processing, analysis and monitoring of the big data generated by various sources at computing centers ...

متن کامل

Distributed Algorithms for Providing Fairness in Heterogeneous Computer Systems

Distributed computing systems often consist of heterogeneous computing resources managed by different administrators. Due to the distributed nature, effective management of the resources may become difficult and the performance of the system may be affected. Also, the users of distributed systems may be self-interested whose goal would be to maximize their own utility. Such selfinterested agent...

متن کامل

A new Shuffled Genetic-based Task Scheduling Algorithm in Heterogeneous Distributed Systems

Distributed systems such as Grid- and Cloud Computing provision web services to their users in all of the world. One of the most important concerns which service providers encounter is to handle total cost of ownership (TCO). The large part of TCO is related to power consumption due to inefficient resource management. Task scheduling module as a key component can has drastic impact on both user...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Services Computing

سال: 2021

ISSN: ['1939-1374', '2372-0204']

DOI: https://doi.org/10.1109/tsc.2018.2836444